The first Dirichlet eigenvalue of bicyclic graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the first twisted Dirichlet eigenvalue

In this paper we prove an isoperimetric inequality for the twisted Dirichlet eigenvalue which was introduced by Barbosa and Bérard in the context of constant mean curvature surfaces. More precisely, we show that in the Euclidean case this eigenvalue is minimized by the union of two equal balls.

متن کامل

On the harmonic index of bicyclic graphs

The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...

متن کامل

On the First Eigenvalue of Bipartite Graphs

In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which is an analog of the Brualdi-Hoffman conjecture for general graphs, and prove the conjecture in some special cases.

متن کامل

The First Dirichlet Eigenvalue and the Yang Conjecture ∗

We estimate the lower bound of the first Dirichlet eigenvalue of a compact Riemannian manifold with negative lower bound of Ricci curvature in terms of the diameter and the lower bound of Ricci curvature and give an affirmative answer to the conjecture of H. C. Yang.

متن کامل

Inverses of bicyclic graphs

A graph G is said to be nonsingular (resp., singular) if its adjacency matrix A(G) is nonsingular (resp., singular). The inverse of a nonsingular graph G is the unique weighted graph whose adjacency matrix is similar to the inverse of the adjacency matrix A(G) via a diagonal matrix of ±1s. Consider connected bipartite graphs with unique perfect matchings such that the graph obtained by contract...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 2012

ISSN: 0011-4642,1572-9141

DOI: 10.1007/s10587-012-0038-1